package 哥德巴赫猜想;

import java.util.Scanner;

public class Main {
    static int N = 1000010, cnt;
    static boolean[] st = new boolean[N];
    static int[] pr = new int[N];

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        init(N - 1);
        while (true) {
            int x = in.nextInt();
            if (x == 0) {
                break;
            }
            for (int i = 1; i <= cnt; i++) {
                int a = pr[i];
                int b = x - a;
                if (!st[b]) {
                    System.out.println(x + " = " + a + " + " + b);
                    break;
                }
            }
        }
    }

    private static void init(int n) {
        for (int i = 2; i <= n; i++) {
            if (!st[i]) {
                pr[cnt++] = i;
            }
            for (int j = 0; pr[j] <= n / i; j++) {
                st[pr[j] * i] = true;
                if (i % pr[j] == 0) {
                    break;
                }
            }
        }
    }
}

